Empirical evaluation of two versions of the Davis-Putnam algorithm
نویسندگان
چکیده
This paper summarizes the author's paper (presented in KR-94 and titled \Directional Resolution: The Davis-Putnam Procedure, Revisited" [Dechter and Rish, 1994]), focusing on its empirical aspects. It compares a resolution based variant of the Davis-Putnam algorithm with a backtracking variant and highlights their sensitivity (or insensitivity) to the problems' structure. Experiments show that the behaviour of the algorithms on problems with special topologies, like chains, di ers dramatically from that on random kcnf problems.
منابع مشابه
Enhancing Maximum Satisfiablility Algorithms with Pure Literal Strategies
Maximum satissability (MAX-SAT) is an extension of sat-issability (SAT), in which a partial solution is sought that satisses the maximum number of clauses in a logical formula. In recent years there has been an growing interest in this and other types of over-constrained problems. Branch and bound extensions of the Davis-Putnam algorithm can return guaranteed optimal solutions to these problems...
متن کاملDISTANCE-SAT: Complexity and Algorithms
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositional framework. The decision problem DISTANCE-SAT that consists in determining whether a propositional CNF formula admits a model that disagrees with a given partial interpretation on at most d variables, is introduced. ...
متن کاملOvercoming Resolution-Based Lower Bounds for SAT Solvers
Many leading-edge SAT solvers are based on the Davis-Putnam procedure or the Davis-Logemann-Loveland procedure, and thus on unsatisfiable instances they can be viewed as attempting to find refutations by resolution. Therefore, exponential lower bounds on the length of resolution proofs also apply to such solvers. Empirical performance of DLL-based solvers on SAT instances from the pigeonhole an...
متن کاملInitial Experiments in Probabilistic Satis abilityMichael
Both satissability problems and probabilistic models are popular in artiicial intelligence and computer science. This paper looks at the rich intersection between these two topics, opening the door for the use of satissability approaches in probabilistic domains. The paper examines a generic probabilistic satissability problem, which can function for probabilistic domains as Sat does for determ...
متن کاملA survey of the satisfiability-problems solving algorithms
The propositional satisfiability (SAT) problem is one of the most fundamental problems in computer science. SAT solvers have been successfully applied to a wide range of practical applications, including hardware model checking, software model finding, equivalence checking, and planning, among many others. Empirical research has been very fruitful for the development of efficient methods for SA...
متن کامل